Design and Analysis of Multi-level Genetic Algorithm with its Application to the Construction of Clock Binary Tree

نویسنده

  • Nan Guofang
چکیده

Genetic algorithm is an effective methodology for solving combinatorial optimization problems, and numerous researchers have undertaken efforts to many kinds of improvement of GAs in order to solve problems in computer science. The clock signal and clock skew become more and more important for the circuit performance in VLSI layout design. Since there are salient shortcomings in the conventional topology construction algorithms for designing a clock network, the multi-level model of clock binary tree is built in this paper, and the binary tree construction algorithm of clock signal based on multi-level genetic algorithm (MLGA) is presented. The experiments on random test cases and standard benchmark test cases show that multi-level genetic algorithm can produce much better clock network design in most cases when compared with conventional heuristic algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of the Genetic Algorithm to Calculate the Interaction Parameters for Multiphase and Multicomponent Systems

A method based on the Genetic Algorithm (GA) was developed to study the phase behavior of multicomponent and multiphase systems. Upon application of the GA to the thermodynamic models which are commonly used to study the VLE, VLLE and LLE phase equilibria, the physically meaningful values for the Binary Interaction Parameters (BIP) of the models were obtained. Using the method proposed in t...

متن کامل

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

Multi-level Thrust Ripples Minimization of Linear Flux Switching Motors With Segmented Secondary by Combined Genetic Algorithm and Response Surface Methodology

Linear flux switching motors with simple passive segmented secondary, referred as Segmented Secondary Linear Flux Switching Motors (SSLFSMs), have low cost secondary and therefore are applicable to transportation systems like Maglev. However, it is shown that the SSLFSMs suffer from high thrust ripples. In this paper, minimizing SSLFSM thrust ripples besides maximizing its developed thrust are ...

متن کامل

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

Optimal Design and Benefit/Cost Analysis of Reservoir Dams by Genetic Algorithms Case Study: Sonateh Dam, Kordistan Province, Iran

This paper presents a method concerning the integration of the benefit/cost analysis and the real genetic algorithm with various elements of reservoir dam design. The version 4.0 of HEC-RAS software and Hydro-Rout models have been used to simulate the region and flood routing in the reservoir of the dam, respectively. A mathematical programming has been prepared in MATLAB software and linked wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006